Heavy traffic approximations for busy period in an M/G/∞ queue

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Error Analysis of the Mean Busy Period of a Queue

The error between the actual value of the mean busy periQ..d and the value estimaled by a common queueing tormula (D;:;: SOl (i-V)) is evaluated. tDenning's addre:'l!l: Department of Compu.ter Sciences, Purdue University, W. Lafayette, IN 41907 USA. KoweJk's addre:iS: FClchbcrcich Inrormatik, Univer:ritut Hamburg. RoUlerbllumschau9ce 07/09, 2000 Hamburg 10, West Gcrmuny.

متن کامل

Global and local asymptotics for the busy period of an M/G/1 queue

We consider an M/G/1 queue with subexponential service times. We give a simple derivation of the global and local asymptotics for the busy period. This analysis relies on the explicit formula for the joint distribution for the number of customers and the length of the busy period of the M/G/1 queue. 2000 Mathematics Subject Classification: 60K25, 60G50, 60F10.

متن کامل

Bounds and Approximations for the Fixed-Cycle Traffic-Light Queue

This paper deals with the fixed-cycle traffic-light (FCTL) queue, where vehicles arrive to an intersection controlled by a traffic light and form a queue. The traffic light alternates between green and red periods, and delayed vehicles are assumed to depart during the green period at equal time intervals. The key performance characteristic in the FCTL queue is the so-called mean overflow, defin...

متن کامل

Transient queue length and busy period of the BMAP / PH / 1 queue

We derive in this paper the transient queue length and the busy period distributions in the single server queue with phase-type (PH) services times and a batch Markovian arrival process (BMAP). These distributions are obtained by the uniformization technique which gives simple recurrence relations. The main advantage of this technique is that it leads to stable algorithms for which the precisio...

متن کامل

Heavy traffic approximations of a queue with varying service rates and general arrivals ∗†‡

Heavy traffic limit theorems are established for a class of single server queueing models including those with heavy-tailed or long-range dependent arrivals and time-varying service rates. The models are motivated by wireless queueing systems for which there is an increasing evidence of the presence of heavy-tailed or long range dependent arrivals, and where the service rates vary with the chan...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Stochastic Processes and their Applications

سال: 1985

ISSN: 0304-4149

DOI: 10.1016/0304-4149(85)90028-6